Network (Tree) Topology Inference Based on Prufer Sequence
نویسندگان
چکیده
Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from end-to-end path metrics between OD (Origin – Destination) pairs. The approach is based on Prüfer encoding and decoding techniques of trees to determine the topology. Keywords-component; Network Tomography, OD, Path, Prüfer sequence, Topology inference, Traffic flow
منابع مشابه
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
Many of the network topology design problems include CMST, which means to find a minimum cost tree that connects all the nodes of the network to the central node with some capacity constraint. The links of edges have associated costs that could be based on their distance, capacity, quality of line etc, and the nodes have their associated demand. Usually most of the network obtained from CMST ar...
متن کاملQuasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks
Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...
متن کاملAn inference routing tree topology algorithm for reducing overhead in packet probing
Network structure (Topology) and Node dynamics (Links) are essential components of a secure robust network monitoring and application design. Packet probing is an important network measurement technique, used to understand packet delays, paths, and loss. In this paper we propose an RNJ(Route Neighbor Joining) algorithm which is a grouping type algorithm that recovers the tree topology by recurs...
متن کاملConsistency of Bayesian inference of resolved phylogenetic trees
Bayesian inference is now a leading technique for reconstructing phylogenetic trees from aligned sequence data. In this short note, we formally show that the maximum posterior tree topology provides a statistically consistent estimate of a fully resolved evolutionary tree under a wide variety of conditions. This includes the inference of gene trees from aligned sequence data across the entire p...
متن کاملSyntax-based Attention Model for Natural Language Inference
Introducing attentional mechanism in neural network is a powerful concept, and has achieved impressive results in many natural language processing tasks. However, most of the existing models impose attentional distribution on a flat topology, namely the entire input representation sequence. Clearly, any well-formed sentence has its accompanying syntactic tree structure, which is a much rich top...
متن کامل